package com.lqs;

public class Onest {
	private static void right_top() {
		int i,j;
		for(i=15;i>9;i--){
			for(int k=0;k<(15-i);k++)
				System.out.print("          ");
			for( j=10;j<=i;j++){
				
					System.out.print(j+"*"+i+"="+(i*j)+" ");
				}
			
			System.out.println();
			}
//		System.out.print("   \n    ");	
	}		


	public static void main(String[] args){		
		right_top();

	}
}
